The efficacy of tournament designs

نویسندگان

چکیده

Tournaments are a widely used mechanism to rank alternatives in noisy environment. This paper investigates fundamental issue of economics tournament design: what is the best usage limited resources, that is, how should be compared pairwise approximate their true but latent ranking. We consider various formats including knockout tournaments, multi-stage championships consisting round-robin groups followed by single elimination, and Swiss-system. They evaluated via Monte-Carlo simulations under six different assumptions on winning probabilities. Comparing same pair multiple times turns out an inefficacious policy. While seeding can increase efficacy group-based designs, its influence remains marginal unless one has unrealistically good estimation ranking players. The Swiss-system found most accurate among all these formats, especially ability participants. A possible explanation it does not eliminate player after loss, while takes history comparisons into account. results interesting for emerging esports, where designs yet solidified.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generalized whist tournament designs

In this study a new class of tournament designs is introduced. In particular, each game of the tournament involves several (two or more) teams competing against one another. The tournament is also required to satisfy certain balance conditions that are imposed on each pair of players. These balance conditions are related to both the total number of players on each team and the number of teams i...

متن کامل

Splittable Triplewhist Tournament Designs

We show that Z-cyclic splittable triplewhist tournament designs exist for all primes of the form p = 8t + 1, t odd, except possibly p = 41.

متن کامل

Imbalance in tournament designs

We introduce two measures of imbalance, the team imbalance, and the field imbalance, in a tournament design. In addition to an exhaustive study of imbalances in tournament designs with up to eight teams, we present some bounds on the imbalances, as well as recursive constructions for homogeneous tournaments.

متن کامل

The existence of court balanced tournament designs

Let V be a set of n elements. A tournament design, TD(n, c), is a c-row array of the (“2) pairs of elements from V such that every element appears at most once is each column. A court balanced tournament design, CBTD(n,c), has the added property that every element appears the same number of times in each row. We show that CBTD(n,c) exist for all n and c satisfying cl(;) and c( n 1 and discuss t...

متن کامل

The Existence of Near Generalized Balanced Tournament Designs

In this paper, we complete the existence of near generalized balanced tournament designs (NGBTDs) with block size 3 and 5. As an application, we obtain new classes of optimal constant composition codes.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computers & Operations Research

سال: 2022

ISSN: ['0305-0548', '1873-765X']

DOI: https://doi.org/10.1016/j.cor.2022.105821